Method and apparatus for route optimisation in nested mobile networks

ABSTRACT

A method of transmitting at least one data packet from a communication node in a data communication network. The method includes receiving ( 920 ) a request at a communication node, to transmit at least one data packet to a first destination address and searching ( 930 ) for the (first) destination address in a cache of the communication node. A determination ( 960 ) of an intermediary address of the destination address is made. The destination address is then replaced with the intermediary address and the steps of searching, determining and replacing are repeated, until no new intermediary address is found. The at least one data packet is then transmit ( 970 ) to the destination address via the identified intermediary address(es). A communication unit (corresponding node) communication message and method for building a linked binding cache are also described. In this manner, an optimised data path is determined in order to send at least one data packet to an intended recipient, for example in a nested mobile network scenario.

FIELD OF THE INVENTION

This invention relates to telecommunication systems in which data flows between mobile nodes, for example personal digital assistants with wireless communication capability, and a data network, for example the Internet.

BACKGROUND OF THE INVENTION

The Internet is becoming more and more popular, and users increasingly wish to access the Internet whilst on the move. Different types of mobile nodes (i.e. mobile communication units) may be employed for this purpose, for example a mobile telephone or a personal digital assistant (PDA) with wireless communication capability.

Increasingly, mobile users are accessing the Internet via different types of fixed or wireless access networks, for example a cellular radio communication network, such as a Universal Mobile Telecommunication System (UMTS) network, a HiperLAN/2 or IEEE 802.11b local area network, a Bluetooth local communication system, or fixed accesses such as the Ethernet, and so on. The data route between the mobile node and the Internet further comprises an Internet protocol subnet (IP subnet), such that the route is as follows: mobile node—access network—IP subnet—Internet (and reverse order for the data route from the Internet to the mobile node).

It is currently possible to seamlessly handover accessing of the Internet from one access network to another, for example by using a protocol known as Mobile-IP.

Traditional mobility support aims to provide continuous Internet connectivity to mobile hosts, thereby allowing individual mobile users to connect to the Internet whilst being mobile and moving their Internet access location. In contrast, network mobility support is concerned with situations where an entire network changes its point of attachment to the Internet topology and thus its accessibility in the topology. Such a network in movement can be called a Mobile Network.

There exist a large number of scenarios where such Mobile Networks exist. For example, a Personal Area Network (PAN, i.e. a network of several personal devices attached to an individual) is known whereby the PAN changes its point of attachment to the Internet topology whilst the user is walking in a shopping mall. In addition, a network may be embedded in a bus or aircraft, providing on-board Internet access to passengers. A passenger may use a single communication device (e.g. a laptop) or be itself a Mobile Network (e.g. a PAN). Notably, this configuration illustrates a case of a Mobile Network visiting a Mobile Network (i.e. nested mobility).

As such, a Mobile Network can be defined as a set of nodes composed of one or more IP-subnets attached to a Mobile Router (MR). These IP subnets may also be viewed as a mobile unit, with respect to the rest of the Internet, i.e. a MR and all its attached nodes (so called Mobile Network Nodes or MNNS).

A document authored by Thierry Ernst, Hong-Yon Lach, IETF Internet-Draft draft-ernst-monet-terminology-00.txt, February 2002, describes a list of definitions for the Mobile Network terminology that can be applied in this application. In particular, the following terms may be defined as follows:

(i) A Local Fixed Node (LFN):

A node permanently located within the Mobile Network and that does not change its point of attachment. A LFN can either be a LoCal Fixed Host (LFH) or a Local Fixed Router (LFR).

(ii) A Local Mobile Node (LMN):

A local mobile node is one that belongs to the Mobile Network and changes its point of attachment from a link within the Mobile Network to another link within or outside the Mobile Network. In this regard, it can be assumed that the home link of the LMN is a link within the Mobile Network. A LMN can either be a Local Mobile Host (LMH) or a Local Mobile Router (LMR).

(iii) A Visiting Mobile Node (VMN):

A VMN is one that does not belong to the Mobile Network, and changes its point of attachment from a link outside the Mobile Network to a link within the Mobile Network (i.e. the home link of the VMN is not a link within the Mobile Network). A VMN that attaches to a link within the Mobile Network obtains an address on that link. A VMN can either be a Visiting Mobile Host (VMH) or a Visiting Mobile Router (VMR).

(iv) A Mobile Network Prefix:

A bit string that consists of a number of initial bits of an IP address, which identifies a Mobile Network within the Internet topology. Nodes belonging to the Mobile Network (i.e. at least MR, LFNs and LMNs) share the same IPv6 “network identifier”. For a single mobile IP-subnet, the Mobile Network Prefix is the “network identifier” of this subnet.

(v) An Egress Interface of a MR:

This is the interface attached to the home link if the Mobile Network is at home. Alternatively, it is the interface attached to a foreign link if the Mobile Network is in a foreign network.

(vi) An Ingress Interface of a MR:

This is the interface attached to a link inside the Mobile Network. This interface is configured with the Mobile Network Prefix.

(vii) A MR may have multiple Egresses and Ingress interfaces.

Recently, there has been a lot of interest and research into the Mobile IPv6 specification, as described in the document authored by David B. Johnson: IETF Internet-Draft draft-ietf-mobileip-ipv6-15.txt, July 2001. A major concern with Mobile Ipv6 is that the research has proven that the IPv6 standard is currently unable to adequately address network mobility. In particular, the document authored by Thierry Ernst and Hong-Yon Lach: IETF Internet-Draft draft-ernst-mobileip-v6-network-02.txt, June 2001, details problems encountered with Mobile-IPv6 in supporting Mobile Networks.

In summary, it has been determined that even if a MR's Home Agent (HA) is able to intercept packets addressed to MNNs that are operating behind the MR, the MR's HA is clearly unable to encapsulate them to the care-of-address of the appropriate MR. Note that every data packet has a source address and a destination address. A tunnelled packet is a packet that encapsulates in it another packet. Thus, the encapsulating packet has a pair of source and destination addresses. A further encapsulated packet has additional source and destination addresses.

The lack of knowledge of a true location of a particular MNN results from the HA not knowing any (never mind a preferred) data route to the Mobile Network, once it has moved to a ‘visited’ location. Unfortunately, when a MR registers with its HA the MR only informs the HA to record a host-specific route in its routing table. The inventors of the present invention have recognised that a preferred network route generated using the mobile network address (prefix, prefix length and care-of-address) of the appropriate MR would greatly assist in this matter.

In the field of this invention, the Mobile IPv4 specification, detailed in C. Perkins, IETF RFC 3220, “IP Mobility Support for IPv4”, Standards Track, January 2002, describes how Network Mobility can be supported in the case of IPv4 mobility. However, it has also been determined that IPv4 does not support route optimisation for MNNs behind the MR. Thus, all the (incoming and outgoing) traffic between a MNN and its corresponding nodes (CNs) is passed to the MR's Home Agent. This problem is exacerbated in the case of nested mobility, which is where a CN wishes to pass data to a MNN that is behind a number of MR links, or a mobile node visiting a mobile network. In the case of nested mobility, the packet will thus be encapsulated several times as a result of being routed through all of the Home Agents of all the nested MRs. This is clearly inefficient routing.

A solution to this routing problem is presented in the document authored by T. J. Kniveton: IETF Internet-Draft draft-kniveton-mobrtr-00.txt, November 2001, where provision of a means to support mobile networks with no modifications to Mobile IP (v4 or v6) is described. The mechanism proposed to address the problem of nested mobility is described with respect to FIG. 2. When a MR, for example MR2 260, has attached to a visited network 110 (via another Mobile Network MR1 link), a bi-directional tunnel 210, 215, 220 is established between MR2 260 and its HA-HA2 250. When a node, for example LFN2 165, is attached to MR2 260 and wishes to send an IP packet to a CN, say CN2 255, via the Internet 115, that packet is tunnelled by MR2 260 (to HA2 250) and again by MR1 150 (to HA1 240). The multiple-tunnelled data packet is then passed to the HA of the latest MR to tunnel the data, namely to HA1 240. HA1 240 then forwards it to the intended recipient CN2 255 via the source MR's HA, namely HA2 250.

This proposed data routing method, and the problems associated with it, are best described by way of an example. Thus, let us assume that LFN2 165 sends a data packet to CN2 255. The data packet is first routed 205 towards MR2 260. The data packet is then tunnelled by MR2 260 to be sent to HA2 250. This tunnelling process of the data packet from MR2 260 to HA2 250 is itself, by necessity, first routed 210 towards its linked MR, namely MR1 150. MR1 150 further tunnels the data and forwards 215 the multiple-tunnelled packet to its HA, namely HA1 240. HA1 240 de-tunnels the data packet, as tunnelled by MR1 150 and forwards 220 the partially de-tunnelled packet to its original intended recipient, HA2 250. HA2 250 further de-tunnels the packet, as tunnelled by MR2 260, and forwards 225 the wholly de-tunnelled data packet to CN2 255.

Clearly, the solution proposed does not provide any support for route optimisation, since both inbound and outbound packets are routed through the Home Agent of both MRs 150, 260. In fact, packets from CN2 255 addressed to LFN2 165 will follow the same path (in reverse order) and will then be encapsulated by each Home Agent 240, 250 of each of the nested MRs 150, 260. Once again, this is clearly inefficient routing, particularly for a practical situation whereby there may be many more than two levels in the nested network.

The solution presented in a document authored by Thierry Ernst and Hong-Yon Lach: IETF Internet-Draft draft-ernst-mobileip-v6-network-02.txt, June 2001, proposes a means for supporting network mobility in the framework of Mobile IPv6. This solution introduces the following concept: when a Mobile Router roams to a visited network, it sends a Prefix Scope Binding Update to its Home Agent (HA). Unlike a classical Mobile IPv6 Binding Update message, a Prefix Scope Binding Update does not bind a home address with a care-of address.

In contrast, the MR Prefix is bound with the MR care-of address, for a particular MR. Upon reception of a packet whose prefix matches with the MR prefix, the Home Agent must then tunnel the packet to the MR care-of-address that has been identified as being able to deliver the tunnelled packet to the intended recipient. Likewise, a MR may send prefix-scope BUs to the corresponding nodes of the nodes it serves. This solution brings a more efficient support of mobile networks to Mobile IPv6, since it may provide a limited improvement to route optimisation.

However, the scope of this draft has explicitly excluded the case of nested mobility, which presents a significant hurdle to efficient route optimisation. As such, the solution proposed in the Thierry Ernst document, IETF Internet-Draft draft-ernst-mobileip-v6-network-02.txt, June 2001, fails to provide a useful solution to route optimisation in many practical situations. Again, the problems that emanate from this document, particularly in the case of nested mobility, are best highlighted in an example situation.

Referring now to FIG. 3, a mechanism for routing data packets in an IPv6 network using the proposal of Thierry Ernst: IETF Internet-Draft draft-ernst-mobileip-v6-network-02.txt, June 2001. Notably, the problems emanating from using this mechanism in a nested mobility are highlighted.

A mobile router MR1 150 is attached to a visited link 110. A mobile router MR2 260 is attached to MR1's link 155. A local fixed node LFN2 165 is attached to MR2's link 230. Again, let us assume that LFN2 165 is attempting to communicate with a corresponding node CN2 255.

Let us further assume that, at the beginning of the simple scenario detailed in FIG. 3, MR1 150 and MR2 260 have already sent BU messages to their respective HAs 240, 250. That is, HA1 240 knows that MR1's 150 prefix is reachable at MR1's care-of address. Similarly, HA2 250 knows that MR2's 260 prefix is reachable at MR2's care-of address.

When a data packet is sent from CN2 255 to LFN2 165, CN2 255 has no knowledge about LFN2's 165 actual location. Thus, the data packet that it sends is therefore routed 325 towards home link-2 105. HA2 250 intercepts the data packet and tunnels it to MR2's care-of address. This can be understood as HA2 250 knows that MR2's prefix is reachable at MR2's care-of address.

This tunnelled packet (from HA2 250 to MR2's 260 care-of address) is routed 320 toward link-1 245, since MR2's 260 care-of address matches MR1's 150 prefix. HA1 240 intercepts the data packet and tunnels it to MR1's care-of address, namely towards the visited link 110, since HA1 240 knows that MR1's prefix is reachable at MR1's care-of address.

MR1 150 then de-tunnels the data packet received from HA1 240. MR1 150 then forwards the content to the original recipient, MR2 260. Meanwhile, MR1 150 sends a Binding Update to the sender of the encapsulated packet (that is HA2 250) to inform it that MR1's prefix is reachable at MR1's care-of address. Note that from MR1's point of view, HA2 250 is a Correspondent Node and not its Home Agent (i.e. the ‘H’ bit in the BU is not set). It is up to the HA2 250 to accept this Binding Update or not.

MR2 260 de-tunnels the data packet that it received (i.e. the portion of the data packet that had been encapsulated by HA2 250) and forwards the content (the initial packet from CN2 255) to LFN2 165. Meanwhile, MR2 260 sends a Binding Update message to the sender of the encapsulated packet (that is, CN2 255) to inform it that MR2's prefix (covering the LFN2 165 address) is reachable at MR2's care-of address. This information is stored in the CN's binding cache 370.

Once an initial packet has reached its destination, transmission of a second or subsequent packet from CN2 255 to LFN2 165 leads to the scenario depicted in FIG. 4. After having reviewed its binding cache 370, CN2 255 recognises that LFN2 165 is reachable at MR2's care-of address. Thus, it sends the data packet to MR2's care-of-address with a routing header for LFN2 165. MR2's care-of-address belongs to MR1's link and is therefore routed towards Home Link-1 245. In this manner, a minor improvement to route optimisation is achieved by the bypassing of the transmission of the data packet to, and from, HA2 250. HA1 240 then intercepts the data packet and tunnels the packet to MR1's care-of address, since HA1 240 knows that MR1's prefix is reachable at MR1's care-of address.

MR1 150 de-tunnels the packet from HA1 240 and forwards the content to the mobile router MR2 260 of the originally intended recipient, LFN2 165. Meanwhile, MR1 150 sends a Binding Update to the sender of the encapsulated packet (that is, CN2 255) to inform it that MR1's prefix is reachable at MR1's care-of address.

When receiving the original packet as sent by CN2 255, MR2 260 replaces its address in the destination field of the packet with the address contained in the routing header (that is, LFN2 165) and forwards the data packet to the ultimate recipient.

The inventors of the present invention have identified a significant problem with the scenario depicted in FIG. 4. All subsequent packets from CN2 255 to LFN2 165 will be routed in exactly the same manner as the second data packet. That is, there will be no subsequent improvement towards route optimisation. This is more clearly shown in respect of FIG. 5.

Referring now to FIG. 5, a known binding cache 500 is illustrated. The binding cache comprises a list of entries, specific to each MR in a nested mobility scenario. The binding cache entries include, for example a MR3 prefix and prefix length 530, with a link 532 to a determined MR3 care-of-address 534, if one has been determined. The MR3 entry 535 is linked 536 to the next entry in the binding cache, namely that for MR2. The MR2 prefix and prefix length 520, includes a link 522 to a determined MR2 care-of-address 524, if one has been determined. A similar arrangement and link 526 is performed to MR1, and so on.

In addition, the binding cache entries include a flag entry (not shown). A ‘P’ flag is the “Prefix Scope Registration” flag. When it is set, a “Home Address” field is filled with the Mobile Network prefix (the prefix that is advertised by the Mobile Router) and the “Prefix Length” corresponds to the length of the Mobile Network prefix.

It is specified in the document by Thierry Ernst: IETF Internet-Draft draft-ernst-mobileip-v6-network-02.txt, June 2001, that the Binding Cache is searched for an entry corresponding to the destination address of the packet in one pass. As a result of the search, either nothing has been found (no entry), or the full address has been found (128-bit match for an IPv6 address, P flag unset), or the first bits of the destination address match with a registered prefix for the registered prefix length. In the latter case, the destination is located in a mobile network.

Therefore, with reference to FIG. 4, when CN2 255 has to send a packet to LFN2 165, CN2 255 still reviews its binding cache and finds the entry ‘MR2 260 prefix reachable at MR2 260 Co@’ 520, 524. CN2 255 does not even consider the entry ‘MR1 150 prefix reachable at MR1 Co@’ 510, 514, as this would appear to have no bearing on the LFN2 address. The inventors have recognised that this deficiency results from the LFN2 165 address being unrelated to the MR1 prefix. The fact that MR2 260 Co@ belongs to MR1 prefix is neither seen, nor even used by CN2 255.

Consequently, the only optimisation that the Thierry Ernst proposal can support is related to the HA (HA2 250) of the MR (MR2 260) serving the communicating MNN (LFN2 165 in the above example). This solution describes indeed a means for having packets be sent directly from CN2 255 to HA1 240, instead of CN2 255 to HA2 250 and thereafter to HA1 240. However, if there were n successive levels of nested mobility, this solution provides minimal route optimisation, no more than having a CN2 255→HA_(n−1)→HA_(n−2)→ . . . →HA1 path instead of CN2 255→HA_(n)→HA_(n−1)→HA_(n−2)→ . . . →HA1 path. This proposal is therefore still clearly inefficient, particularly in the case of nested networks.

A need therefore arises for a mechanism, apparatus and associated methods to support route optimisation in Network mobility, especially in the case of IPv6. In particular, a need has arisen to support route optimisation in the case of nested mobility, wherein the aforementioned problems are substantially alleviated.

STATEMENT OF INVENTION

In accordance with a first aspect of the present invention, there is provided a method of transmitting at least one data packet from a communication node in a data communication network, as claimed in Claim 1.

In accordance with a second aspect of the present invention, there is provided a method of generating a routing header, as claimed in Claim 11.

In accordance with a third aspect of the present invention, there is provided a communication message, as claimed in Claim 15.

In accordance with a fourth aspect of the present invention, there is provided a communication message, as claimed in claim 16.

In accordance with a fifth aspect of the present invention, there is provided a communication unit, as claimed in Claim 18.

In accordance with a sixth aspect of the present invention, there is provided a communication unit, as claimed in claim 20.

In accordance with a seventh aspect of the present invention, there is provided a method for building a linked binding cache, as claimed in claim 21.

In accordance with a eighth aspect of the present invention, there is provided a storage medium storing processor-implementable instructions, as claimed in Claim 27.

In accordance with a ninth aspect of the present invention, there is provided an apparatus, as claimed in Claim 28.

In accordance with a tenth aspect of the present invention, there is provided a communication unit, as claimed in Claim 29.

In accordance with a eleventh aspect of the present invention, there is provided a communication system, as claimed in Claim 30.

Further aspects of the present invention are as claimed in the dependent Claims.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 illustrates the movement of a Mobile Network in an Internet;

FIG. 2 illustrates a known packet data routing mechanism for mobile networks when applied to nested mobility;

FIG. 3 illustrates a known packet data routing mechanism for mobile networks when applied to nested mobility that highlights the inefficiency of the data routing;

FIG. 4 illustrates a known packet data routing mechanism for mobile networks when applied to nested mobility that highlights the inefficiency of an improved process of the data routing; and

FIG. 5 illustrates a known binding cache for routing data packets in mobile node networks.

Exemplary embodiments of the present invention will now be described, with reference to the accompanying drawings, in which:

FIG. 6 illustrates a packet data routing mechanism for mobile networks when applied to nested mobility in accordance with the preferred embodiment of the present invention;

FIG. 7 illustrates a simple linked binding cache configuration in accordance with the preferred embodiment of the present invention;

FIG. 8 illustrates a generic linked binding cache configuration in accordance with the preferred embodiment of the present invention;

FIG. 9 illustrates a flowchart of a process of accessing address information from a linked binding cache in accordance with the preferred embodiment of the present invention; and

FIG. 10 illustrates a flowchart of a method to build a linked binding cache in accordance with the preferred embodiment of the present invention.

FIG. 11 illustrates preferred examples of routing headers, generated in accordance with embodiments of the present invention.

DESCRIPTION OF PREFERRED EMBODIMENTS

There is currently no standard mechanism to support Network mobility adequately, particularly in the case of IPv6 for nested mobility data networks. In particular, there is no provision or support for route optimisation. This is a major issue, as nested mobility is a very realistic scenario for Mobile Router applications. In addition route optimisation is much more important with regard to movement of a Mobile Network, than for movement of a single Mobile Node, since the amount of traffic handled is much greater.

The preferred embodiment of the present invention is described with respect to route optimisation in transmitting at least one data packet between a corresponding node (communication unit) and a local fixed node (or vice versa). It is envisaged that the corresponding node may be any communication unit capable of sending a data packet across a data network (such as the Internet), for example, a web server, a PC, or a workstation running a web server such as www.yahoo.com, etc. The CN may also be any mobile data communication unit such as a general packet radio system (GPRS) device or a 3^(rd) generation (3G) cellular phone, a personal digital assistant (PDA), etc., connected to the data network through any type of access.

Referring now to FIG. 6, a packet data routing mechanism 600 for mobile networks is illustrated; particularly one supporting nested mobility, in accordance with the preferred embodiment of the present invention. A skilled artisan would recognise that the number of elements shown in the network of FIG. 6 are limited for clarity purposes only.

The new mechanism provides route optimisation, i.e. determining the shortest direct path for communication between a MNN's Correspondent Nodes and this MNN. The preferred embodiments of the present invention find particular applicability in nested mobility scenarios (that is Mobile Networks visiting Mobile Networks). The improvement is primarily achieved by adding intelligence to a Corresponding Node (CN) 655.

The CN 655 in accordance with the preferred embodiment of the present invention has been adapted to include (i.e. at least generate, update and search) a new binding cache. The new binding cache is a linked binding cache 670 that provides pointers between cache addresses to improve data packet route optimisation. An adapted processor 605 that is operably coupled to the linked binding cache 670 performs the generation, updating and searching of the linked binding cache 670. The processor is coupled to, or contains, a routing process 610, to generate data packet routes based on the pointers stored in the linked binding cache 670. An interface 615 is provided on the CN 655 to facilitate the improved delivery of data packets from CN 655. The operation of the CN 655, processor 605, the routing process 610 and the linked binding cache 670 are described in greater detail in the sections below.

Adaptation of the CN 655 may be implemented by configuring or adapting any suitable element, for example processor 605. Alternatively, a new processor implementing processor-implementable instructions and/or stored on a suitable storage medium, such as computer memory, hard disk, floppy disk, ROM, PROM etc, may be used to implement the processes described. The processor may, in some configuration, be a computer, a network of computers, or one or more dedicated processors.

More particularly, in the case of those performed by the CN, a memory element (not shown) other than the binding cache 670, for storing data or processes used in the delivery of data packets may be adapted.

Notably, the scenario in FIG. 6 illustrates how the mechanism described with relation to FIG. 4 may be extended and improved to provide an adequate solution in nested mobility situations.

As described above with reference to FIG. 4, when CN2 255 has to send a packet to LFN2 165, CN2 255 reviews its binding cache and finds the entry that the MR2 260 prefix is reachable at the MR2 care-of-address 520, 524. Hence, for all data packets being sent to LFN2 165, CN2 255 sends the data packet to MR2's care-of address that will intercepted by HA1 240, the home agent of MR1 150.

The inventors of the present invention propose to extend the above technique by incorporating intelligence in the CN. In this regard, as shown in FIG. 6, when the CN 655 is about to send a data packet to any mobile node (MN) or fixed node, for example LFN 165, CN 655 reviews its binding cache following a defined pattern. In the known technique, the CN (CN2 255) reviews its binding cache and finds the MR entry (i.e. the MR2 260 prefix is reachable at the MR2 care-of-address 520, 524) and stops at this point. In contrast to the known technique, when a registered intermediate address (i.e. a care-of-address) has been found for MN (or MN prefix if MN is behind a mobile router), this care-of-address is again searched in the binding cache. If the care-of-address is covered by a prefix for which a BU has been received, the corresponding new care-of-address is searched and so on. Meanwhile, the routing header of the outbound packet is constructed so that it includes all (care-of/intermediate) addresses that have been successively found within the binding cache 670. The construction of the routing header is shown in greater detail in FIG. 11.

In this manner, the full route for the data packet can be determined by improved extraction and utilisation of data within the improved binding cache.

If we consider the example depicted in FIG. 6 the following process would occur when a data packet is to be sent from CN 655 to LFNn 665. CN 655 searches its linked BC 670 entries for LFNn address. If the LFNn address is based on MR2 prefix (that is, LFNn address and MR2 prefix first ‘MR2 prefix length’ bits are identical), the MR2 care-of-address is returned. The CN 655 then searches its linked BC 670 entries for the MR2 care-of address, which is based on the MR1 prefix (that is: MR2 care-of-address and MR1 prefix first ‘MR1 prefix length’ bits are identical). Thus, the MR1 care-of-address is returned. The CN 655 then searches its linked BC 670 entries for the MR1 care-of address. Notably, nothing is returned. Therefore, the linked binding cache search ends, and the CN 655 has knowledge of the optimum route to be used for the data packet to reach the intended recipient.

Thus, CN 655 knows that the data packet has to be sent first to MR1 150, at MR1's care-of-address. CN 655 also knows that once MR1 150 forwards the data packet to MR2 155, MR2 155 is able to pass the data packet to its intended recipient LFN 665. Note that these further hops have been stored in memory (either cache or an alternative memory) in order to build the Routing Header for that (and any subsequent) data packet to be sent to LFN 665, as described further below.

The process shown in FIG. 6 illustrates a practical scenario, where many nested levels may exist. Hence, the aforementioned process may be easily generalized to an example of nested mobility involving n successive levels (n mobile routers MR₁, . . . , MR_(n) and n corresponding home agents HA₁, . . . , HA_(n)). In this regard, let us assume that a local fixed node LFN is attached to MRn and the LFN is communicating with a corresponding node CN.

In the following description, the following nomenclature is used:

-   -   A ‘→’ represents a tunnelled packet, whereas     -   A ‘→’ represents a “normal” packet, possibly containing a         Routing Header.

A first data packet CN→LFN is sent through in the following manner: CN→HA_(n)→ . . . →HA₁→MR₁→ . . . →MR_(n)→LFN.

Notably, MR_(n) de-tunnels the packet from HA_(n) and sends a prefix scope BU to CN 655, informing CN 655 that MR_(n) prefix is reachable at MR_(n) care-of address.

Subsequently, a next packet CN→LFN is sent through in the following manner: CN→HA_(n−1)→ . . . →HA₁→MR₁→ . . . →MR_(n−1 l MR) _(n)→LFN.

MR_(n−1) de-tunnels the packet from HA_(n−1) and sends a prefix scope BU to CN 655 informing CN 655 that the MR_(n−1) prefix is reachable at the MR_(n−1) care-of address. On receipt of the BU, the CN 655 recognises that the packet has been sent to link n−1 (and then intercepted by HA_(n−1)), as the CN 655 knows that the LFN is contactable by MR_(n) link and that MR_(n) is currently at MR_(n) care-of address, which is coupled to link n−1.

Subsequently, a next data packet to be sent from the CN 655 to the LFN leads to the following CN operation. The LFN matches with the MR, prefix, so the MR_(n) care-of-address is returned. The MR_(n) care-of-address matches with MR_(n−1) prefix, so the MR_(n−1) care-of-address is returned. Notably, the MR_(n−1) care-of-address does not match with any prefix (MR_(n−2) binding update has not been received yet). Thus, the packet is sent through in the following manner: CN→HA_(n−2)→ . . . →HA₁→MR₁→ . . . →MR_(n−2)→MR_(n−1)→MR_(n)→LFN.

Since it receives a tunnelled packet, MR_(n−2) sends a prefix scope binding update to CN 655.

Ultimately, the next packets lead to the CN operating in the following manner. The LFN address matches with MR_(n) prefix. Hence, the MR_(n) care-of-address is returned. The MR_(n) care-of-address matches with MR_(n−1) prefix. Hence, the MR_(n−1) care-of-address is returned. Following the same principle through the nested mobility network, the MR₃ care-of-address matches with the MR₂ prefix. Hence, the MR₂ care-of-address is returned. Notably, the MR₂ care-of-address does not match with any prefix, as MR₁ BU has not been received yet. Thus, the packet is sent through in the following manner: CN→HA₁→MH₁→MR₂→ . . . →MR_(n)→LFN.

Since it receives a tunnelled packet, MR₁ then sends a prefix scope binding update to CN 655.

The CN 655 then has a complete route mapped out for sending data packets to LFN. Hence, when the next packet is to be sent, the CN 655 operates in the following manner. The LFN matches with MR_(n) prefix. Hence, the MR_(n) care-of-address is returned. The MR_(n) care-of-address matches with MR_(n−1) prefix. Hence, the MR_(n−1) care-of-address is returned. And so on, until the MR₂ care-of-address matches with MR₁ prefix. Hence, the MR₁ care-of-address is returned. The MR₁ care-of-address does not match with any prefix (which is to be expected, as the MR1 is not visiting a mobile router). Thus, the data packet is sent through in the following manner: CN→MR₁→MR₂→ . . . →MR_(n)→LFN.

Notably, the data packet is sent through with the minimum of de-tunnelling operations, thereby achieving ideal route optimisation.

Advantageously, no restriction is placed on the sender of the data packet or the intended recipient. Hence, the preferred embodiments apply in the same manner, whether the sender or intended recipient is either fixed or mobile, for example, the sender may be a fixed CN or a Mobile Node (MN), and the intended recipient may be a Mobile Network or a fixed node (i.e. LFN) or a mobile node at home in the Mobile Network (i.e. LMN) or a Mobile Node visiting a Mobile Network (i.e. VMN).

Furthermore, in the preferred embodiment of the present invention, the search in the Linked Binding Cache does not stop after an initial entry has been found. On the contrary, the search continues until the returned care-of-address fails to match with any mobile router prefix for the first ‘MR prefix length’ bits of the address being searched.

In accordance with the preferred embodiment of the present invention, a new method of building a Routing Header for outbound packets has been described, as above.

Using the generated routing header, as explained in the previous section, after reception of the Binding Updates from all intermediate MRs, the packets are sent through in the following manner: CN→MR₁→MR₂→ . . . →MR_(n)→LFN.

This efficient routing operation is achieved through the recovery of all intermediate MR care-of addresses, whilst determining the last MR (the care-of-address to which the packet has to be sent) in the sequence. In this example, once the binding cache information has been generated as above, the MR_(n) care-of-address is searched in the Linked Binding Cache. It is then found that the MR, care-of-address matches with MR_(n−1) prefix. Thus, MR_(n−1) care-of-address is searched for. However, notably, the MR, care-of-address is not lost or discarded, but is added to the routing header, in accordance with the preferred embodiment of the present invention.

Hence, the routing header is dynamically constructed. In the first packets sent (before any Binding Update is received), there is no routing header and the destination address is the LFN address. In the packets to be sent after reception of Binding Update from MR_(n), the routing header consists of the LFNn address and the data packets are sent to the MR_(n) care-of address. Subsequent data packets to be sent are addressed as will be understood from the aforementioned description. In the last data packets, sent after reception of a Binding Update from the last intermediate MR (i.e. MR1), the routing header consists of the following: {MR₂ care-of address, MR₃ care-of address, . . . , MR_(n) care-of address, LFNn address}. The data packets are then sent to the MR₁ care-of address.

The mechanisms described above for determining the destination address and building the Routing Header for CN outbound packets achieves route optimisation for data packets addressed to LFN in n steps, where the 1^(st) packets are sent without any optimisation, and the last packets are sent with full optimisation (once the n Binding Updates from the n intermediate MRs have been received one after the other by CN). The full route optimisation is achieved in incremental steps since a Binding Update from an intermediate MR (e.g. MRn−i) will be received by the CN only once the Binding Update from the lower MR (i.e. MRn−i+1) has been received. This is due to the fact that MRs send their first Binding Update to CN only once they received a data packet from CN that has been encapsulated by their own HA. This implies that in the best case, full route optimisation is only achieved for the (n+1)th packet sent by CN to LFN, where the n previous packets have consecutively triggered the emission of Binding Updates from the n intermediate MRs in the following order (MRn, MRn−1, . . . , MR2, MR1).

In accordance with an enhanced embodiment of the present invention, a method of determining a destination address and building a routing header in a single step is described. Thus, in summary in the enhanced embodiment, route optimisation may be achieved in a single step as follows:

-   -   A 1^(st) packet is sent without any optimisation, and     -   A 2^(nd) packet and all the subsequent packets are sent with         full optimisation, that is CN→MR₁→ . . . MR_(n)→LFN.

This enhancement to obtain route optimisation in a single step is based on extensive MR de-tunnelling. In summary, route optimisation was obtained in n steps in the above example because MR_(n) is the only MR to send a BU to CN in the first step. Similarly, MR_(n−1) is the only MR to send a BU to CN in the second step (data packet sent after BU from MRn has been received), and so on. The inventors of the present invention have recognised that route optimisation may be achieved in a single step if all MRs send a BU to the CN in the first step, with a modified de-tunnelling technique.

Such a modified technique extends the known art, as described in the Thierry Ernst proposal, in: IETF Internet-Draft draft-ernst-mobileip-v6-network-02.txt, June 2001. Here, it is specified that a Mobile Router must send a BU “to the source address of the inner packet” when receiving a tunnelling packet from its Home Agent. That inner packet may very well be itself a tunnelling packet. In this context, the MR does not inspect the content of the data packet.

Therefore, the inventors propose that, in order to achieve route optimisation in a single step, the MR has to send a binding update to the source address contained in the innermost-tunnelled packet. That innermost tunnelled packet is the packet that is not itself a tunnelling packet. Note however that each of the nested MRs must only de-tunnel one level (partially de-tunnel) before forwarding the packet; de-tunnelling the whole packet is done internally only for obtaining the BU destination.

As described above, a key feature of the present invention is the increased intelligence in the CN, coupled to the new processes in building and using the CN's linked binding cache.

Existing binding caches, as shown in FIG. 5, can be viewed as a list of two-element lists. Here, each entry consists of a home address (+possibly the prefix length in case of a prefix entry) and the corresponding care-of address.

The inventors of the present invention have also proposed an improved mechanism for building a linked binding cache. The method described above requires the CN to run through its binding cache ‘n’ times, in the case of nested mobility involving ‘n’ levels of mobile routers, in order to build the linked binding cache.

However, in accordance with the preferred embodiment of the present invention, it is proposed that the linked binding cache is built by adding direct pointers from an entry A to another entry B, when the care-of-address of entry A fits into the range defined for the other entry B prefix. It is envisaged that the processor 605 would build the linked binding cache 670, using the MR care-of-address information received through interface 615 and processed by processor 605.

For the simple network scenario shown in FIG. 4, whereby LFN is reached via a first MR (MR1) 150 and a second MR (MR2) 260, the entry of MR2 260 has been adapted to reference (direct pointer) the entry of MR1 150. This linked binding cache arrangement 670 is illustrated in FIG. 7. As before a binding cache address comprises a list of addresses, specific to each MR in a nested mobility scenario. The binding cache entries may include, for example, a MR2 prefix and prefix length 520, with a link 522 (internal to each entry) to a determined MR2 care-of-address 524, if one has been determined. The MR2 entry 525 is linked 526 to the next entry in the binding cache, namely that for MR1. The MR1 prefix and prefix length 510, includes a link 512 to a determined MR1 care-of-address 514, if one has been determined. A similar arrangement and link may be performed to MR3, and so on.

In accordance with the preferred embodiment of the present invention, the linked binding cache 700 has been identified as individual entries for each MR, namely MR1 entry 515 and MR2 entry 525. This reflects the entry link between the prefix and prefix length to any care-of-address that has been identified for that MR. The binding cache has been adapted to include a pointer 720 between the respective MR entry, for example MR2 entry 525 and the MR1 entry 515, thereby creating a linked binding cache 670.

It is within the contemplation of the present invention that such a pointer 720 may be effected between the source entry and the care-of-address of the pointed entry, or from the source entry to the MR prefix and prefix length (510) of the pointed entry.

The above methodology can be extended to the case of an n-level nested mobility, as shown in FIG. 8. For a generic n-level nested mobility network scenario, the linked binding cache arrangement 800 includes ‘n’ individual BC entries 515, 525 . . . 860, 850. As before in FIG. 7, each BC entry includes fields relating to the MR prefix and prefix length, with the associated care-of-address, if known, specific to each MR.

The binding cache entries may include, for example, a MR2 prefix and prefix length 520, with a link 522 to a determined MR2 care-of-address 524, if one has been determined. The MR2 entry 525 is linked 526 to the next entry in the binding cache, namely that for MR1. The MR1 prefix and prefix length 510, includes a link 512 to a determined MR1 care-of-address 514, if one has been determined. This arrangement and associated links are translated to the MRn−1 and MRn links as shown in FIG. 8.

In accordance with the preferred embodiment of the present invention, the binding cache 800 has been adapted to include links 720, 870, 840 between the respective MR entry and the other entries it points to, thereby creating a generic linked binding cache. A direct pointer is added from an entry A to an entry B if and only if entry B prefix matches with the ‘entry B Prefix Length’ first bits of entry A care-of address. In FIG. 8, the pointer 840 has been included since MRn−1 prefix matches with the ‘MRn−1 Prefix Length’ first bits of MRn care-of address, and so on.

Advantageously, the creation and use of this linked binding cache (i.e. binding cache extended with the direct pointers as described above) requires minor modifications to existing binding caches and associated searching algorithms. In this regard, the respective MR care-of-addresses are highlighted as being linked to entries whose prefix match the care-of addresses. This is achieved in the routing process, by routing process function 610. Furthermore, by implementing the inventive concepts described herein, a CN is no longer limited to determining a single care-of-address, based on a determination of the initial routing MR—particularly in the case of nested network mobility. The routing process 610 in the CN is able to map the whole route, through successive MRs, that a data packet would need to take to reach its intended recipient. In this manner, route optimisation of the data packet can be achieved.

In summary, the linked binding cache effectively generates a data route for the data packet to be sent, in contrast to existing binding caches that identify a single address (including prefix, prefix length and a single care-of-address, if known).

Referring now to FIG. 9, a flowchart 900 illustrates the preferred method of searching through a binding cache, in accordance with the preferred embodiment of the present invention. The method is performed at the CN, and starts at step 910.

Once a CN receives a request to send a data packet to a destination address, in step 920, the CN searches for that destination address in its binding cache. If the destination is found in step 940, the address is added to the routing header, as shown in step 950. The care-of-address of the ‘found’ destination address is then used to replace, in step 960, the destination address to be searched in step 930.

Note that the aforementioned search method in the BC is general, and may apply even if the advanced pointer concept is not implemented. In that case, recursive parsing of the BC is performed for each care-of address found.

Once no destination address can be found in step 940, the data packet is sent, in step 970.

In the preferred embodiment of the present invention, recursive steps 930, 940, 950 and 960 in FIG. 9, that of searching for a list of care-of addresses in the binding cache, will preferably use a linked binding cache, as described with reference to FIG. 7 and FIG. 8. This will improve efficiency since the list of care-of addresses forming the optimal route to a destination can be found in a single step, with a so-called linked binding cache; as opposed to a non-linked binding caches where recursive parsing is then required.

Referring now to FIG. 10, a flowchart 1000 illustrates a method for building a linked binding cache, in accordance with the preferred embodiment of the present invention. The CN builds the linked binding cache based on binding update messages received from a number of MRs.

The process starts in step 1002, with the CN receiving a new binding cache (BC) entry from a MR in step 1004, which is any BC entry that has been received in a Binding Update. That is, the entry may be a completely new entry, or an update (new Co@, same Home Prefix (HP)) of an existing entry. The CN then starts a process of reviewing all BC entries, in step 1006, to determine any pointers between the new BC entry for that MR and any previously stored BC entries.

The process of reviewing all BC entries to determine any pointers between the new BC entry for that MR and any previously stored BC entry starts with the first BC entry in the linked binding cache. Making the current BC entry the first BC entry in the linked binding cache, as in step 1008, can readily do this. In addition, the preferred embodiment of the present invention uses two flags: (i) a Test_Up_Flag, and (ii) a Test_Down_Flag, which are both set to a ‘true’ status. The Test_Up_Flag is used to indicate whether to test if a current BC Entry points to “New BC Entry” or not. The Test_Down_Flag indicates whether to test if a current BC Entry has to be pointed to by “New BC Entry” or not.

The home prefix (HP) of the current BC entry is then compared to the home prefix of the new BC entry for that MR, as shown in step 1010. Basically, if this determination is true, it identifies a “New BC Entry” as an update of an existing entry (since a single HP cannot have more than one Co@). Furthermore, if this test is true, then the “Current BC Entry” has been found that the entry “New BC Entry” has to update.

With regard to the use of flags, if the home prefix of the current BC entry matches the home prefix of the new BC entry for that MR, in step 1010, the Test_Up_Flag is set to a ‘false’ status, in step 1012. The care-of-address of the current BC entry is set to equal the new BC entry in step 1014.

Additionally, the pointer associated with the current BC entry is set to equal the pointer of the new BC entry, also in step 1014. This feature is important point as it erases a possible pointer from the ‘Current BC Entry’, which is no longer valid since Co@ has just changed, and replaces it with the pointer from the ‘New BC Entry’, if it exists.

The new BC entry is then made equal to the current BC entry, in step 1016, and the current BC entry moved to the next BC entry in the binding cache 1036 if the current BC entry is not the last entry in the Binding Cache 1034. This is required because the data structure of the ‘New BC Entry’ is dropped at the end of the process, as it is only used as an update.

A determination is then made again as to whether the home prefix of the current BC entry matches the home prefix of the new BC entry for that MR, in step 1010.

When there is no match, in step 1010, a determination is made as to whether the Test_Up_Flag is a ‘true’ status, as in step 1020. If the Test_Up_Flag is a ‘true’ status, in step 1020, a determination of whether the care-of-address of the current BC entry matches the home prefix of the new BC entry is made in step 1022. If there is no match, the method moves to step 1026. If there is a match, in step 1022, then a pointer is added from the current BC entry to the new BC entry, in step 1024.

The method then moves to step 1026, where a determination is made as to whether the Test_Down_Flag is a ‘true’ status. If the Test_Down_Flag is a ‘true’ status, in step 1026, a determination of whether the care-of-address of the new BC entry matches the home prefix of the current BC entry is made in step 1028. If there is no match, the method moves to step 1034. If there is a match, in step 1034, then a pointer is added from the new BC entry to the current BC entry, in step 1030. The Test_Down_Flag is then set to a ‘false’ status, as shown in step 1032.

A determination is made as to whether all of the BC entries have been checked, in step 1034. When the end of BC has been reached, a determination is still made as to whether the ‘New BC Entry’ was actually new, or if it was an update. If all of the BC entries have not yet been checked within this ‘pass’, i.e. the current BC entry is not the last BC entry in step 1034, a determination is made as to whether remaining entries in the linked binding cache have to be considered or not 1035. If both the Test_Up_Flag and Test_Down_Flag are set to ‘false’, there is no need to consider the remaining entries in the linked binding cache: the linked binding cache has been updated 1042 and the process ends 1044. If one of (or both) Test_Up_Flag and Test_Down_Flag is not set to ‘false’ the remaining entries in the linked binding cache need to be considered. Hence, the current BC entry is moved on to the next BC entry in step 1036. The process then moves to a determination of whether the home prefix of the current BC entry matches the home prefix of the new BC entry for that MR, in step 1010.

Otherwise, a determination is made as to whether the Test_Up_Flag is a ‘true’ status, in step 1038. If the Test_Up_Flag is a ‘true’ status, in step 1038, then a new BC entry is added at the end of the BC, in step 1040. This effectively means that the status has remained the same and that an entry to update has not been found whilst reviewing all BC entries. As a consequence, “New BC entry” has to be added at the end of the BC.

However, if the Test_Up_Flag is a ‘false’ status, in step 1038, the ‘New BC Entry’ was an update. Hence, the same prefix was found. Once all of the BC entries have been checked, the linked binding cache for that MR has been generated, in step 1042 and the process ends, in step 1044.

At the end of the process, either a New BC Entry will be added to the BC, or it will have updated an existing BC entry. In this manner, a linked binding cache can be generated for each and every new BC entry that is received by the CN. The linked binding cache can then be used in a much more efficient manner when data packets are to be sent through the network, as the route to each and every MNN, LFN can be quickly determined.

It is noted that step 1035 is a preferred option, in order to minimise cost, CPU run-time, etc. of the update of the BC. In other embodiments the process may, for example, follow steps 1034 to 1036.

Furthermore, it is noted that step 1026 is merely a preferred option in order to minimise cost, CPU run-time, etc. of the update of the BC. In other embodiments the process may, for example, follow steps 1020 to 1028.

Furthermore, the various steps described above need not necessarily be performed in the order they have been described. A skilled artisan would recognise that an alternative order may be used, where benefit can still be gained in the route optimisation process. For instance: the block formed with steps {1020, 1022, and 1024} can be made after the block formed with steps {1026, 1028, 1030, and 1032}.

Referring now to FIG. 11, the routing header 1120 according to the preferred embodiment of the present invention is shown. This routing header is included in data packets sent by CN to an intended recipient (in a Mobile Network). As previously indicated, the data packet 1100 includes a single IP header, incorporating an IP source address (CN address) 1110, and an IP destination address of the first intermediate address (MR1 care-of-address) 1115. The data packet includes further the routing header 1120 filled with IP intermediate addresses that form the route to the intended recipient, for example a LFN. Following the address information, the packet data (payload) is attached 1130.

It is within the contemplation of the invention that the aforementioned techniques of recursive parsing of a BC and/or use of an optimised linked binding cache may use any source routing mechanism. As such, the use of the routing header 1120 is a preferred option only. An alternative mechanism of source routing is also illustrated in FIG. 11.

In this regard, a tunnelling operation is performed by the CN, when the CN wants to send a packet to an intended recipient (in a Mobile Network). The CN uses multiple encapsulations 1150 (i.e. multiple tunnelling operations) of the data packet to source route the packet to the destination. In this regard, the data packet 1150 includes the first IP header, incorporating an IP source address (CN address) 1110, and an IP destination address of the first intermediate address (MR1 care-of-address) 1115, as in the preferred routing header. However, each intermediate IP header will have the sender address as the source address 1110 and one of the ‘n’ consecutive IP intermediate addresses 1160, 1170, etc., as the destination address. Finally, the original IP packet from the CN to the LFN will be included in the header, namely the addresses of the CN and LFN together with the packet data 1130.

It is to be appreciated that the arrangement and specific details of interfaces, address types, routers etc. in the above embodiments are merely examples, and the invention is not limited to these examples. The invention should be viewed as capable of being applied to other aspects of the Internet or other types of data networks or protocols and subnets thereof. Furthermore, the invention may also be applied to networks other than the Internet, when such networks have subnets and access networks corresponding to those described above for the case of the Internet.

The invention, or at least embodiments thereof, tend to provide the following advantages, singly or in combination:

-   -   (i) A data packet may be transmitted much more efficiently, with         a minimum of number of tunnelling operations performed by         intermediary home agents, thereby achieving improved route         optimisation.     -   (ii) Route optimisation may be ascertained in a single step         operation, based on extensive MR de-tunnelling.     -   (iii) An improved binding cache (a linked binding cache) can be         created and used with minimal additional processing or memory         requirements.     -   (iv) A solution for efficient data routing in IPv6, IPv4 or         similar data network protocol has been achieved, particularly         for systems supporting nested network mobility.

Whilst the specific and preferred implementations of the embodiments of the present invention are described above, it is clear that one skilled in the art could readily apply variations and modifications of such inventive concepts.

Thus, a mechanism, apparatus and associated methods to support route optimisation in Network mobility, especially in the case of IPv6, have been described, whereby the disadvantages associated with known mechanisms, apparatus and associated methods have been substantially alleviated. In particular, a mechanism, apparatus and associated methods to support route optimisation in the case of nested mobility, have been described. 

1. A method of transmitting at least one data packet from a communication node in a data communication network, the method comprising the steps of: receiving a request at a communication node, to transmit said at least one data packet to a first destination address; searching for said (first) destination address in a cache of the communication node; determining an intermediary address of said destination address; the method characterised by the steps of: replacing said destination address with said intermediary address to form a new destination address; repeating said steps of searching, determining and replacing for said new destination address(es), until no new intermediary address is found; and transmitting said at least one data packet to said destination address via said intermediary address(es).
 2. The method of transmitting at least one data packet from a communication node in a data communication network according to claim 1, wherein said data communication network supports nested network mobility operation and said step of transmitting includes the step of: routing said at least one data packet via a plurality of routers in said nested mobility network.
 3. The method of transmitting at least one data packet from a communication node in a data communication network according to claim 1, wherein said data communication network operates in accordance with an IPv6 and/or IPv4 specification.
 4. The method of transmitting at least one data packet from a communication node in a data communication network according to claim 1, wherein the intermediary address(es) comprise a care-of-address for a previous address in a nested network.
 5. The method of transmitting at least one data packet from a communication node in a data communication network according to claim 1, wherein the communication node is a fixed corresponding node or a mobile node or the an intended recipient of the at least one data packet is a fixed node, for example a Local Fixed Node, or a Local Mobile Node or a Visiting Mobile Node.
 6. The method of transmitting at least one data packet from a communication node in a data communication network according to claim 1, the method further characterised by the step of: adding a plurality of said destination address(es) and/or said intermediary address(es) to a routing header upon finding said destination address or intermediary address(es), thereby providing a desired route for delivering said at least one data packet to an intended recipient.
 7. The method of transmitting at least one data packet from a communication node in a data communication network according to claim 6, wherein said step of adding includes adding a destination address of an intended recipient to said header; and adding one or more subsequent address(es) as subsequent routers acknowledge their presence in a route of said data packet.
 8. The method of transmitting at least one data packet from a communication node in a data communication network according to claims 1, the method further characterised by the step of: adding a plurality of IP headers containing said intermediary address(es) to said at least one data packet upon finding said intermediary address(es), thereby providing a desired route for delivering said at least one data packet to an intended recipient.
 9. The method of transmitting at least one data packet from a communication node in a data communication network according to claims 5, wherein said step of adding includes determining an address of a final router to provide said intended recipient with said at least one data packet in order to complete a data route.
 10. The method of transmitting at least one data packet from a communication node in a data communication network according to any preceding claim, the method further characterised by the steps of: de-tunnelling a portion of said at least one data packet at a router having an intermediary address, in order to determine an address of the communication node; and transmitting said intermediary address to said communication node.
 11. A method of generating a routing header for transmitting a number of data packets from a communication node to an intended recipient over a data communication network that supports nested network mobility operation, the method comprising the step of: transmitting a first data packet to a destination address of said intended recipient via a plurality of routers in said nested mobility network, each router identified by an intermediary address; the method characterised by the steps of: de-tunnelling at least a portion of said at least one data packet at a number of routers, in order to determine an address of the communication node; transmitting respective intermediary addresses from respective routers, operating in a data path of said first data packet, to said communication node; and generating a routing header of a subsequent second data packet, at said communication node, for transmission of the second data packet to the intended recipient based on said respective intermediary addresses.
 12. The method of generating a routing header according to claim 11, wherein the steps of de-tunnelling and transmitting intermediary addresses are performed by substantially all of the mobile routers in the data path of said first data packet, thereby generating a substantially optimum route of the routing header for subsequent data packets transmitted to said intended recipient.
 13. The method of generating a routing header according to claim 11, wherein the steps of de-tunnelling and transmitting intermediary addresses are performed upon successive transmissions of data packets to said intended recipient by a successive one respective router in the data path.
 14. The method of generating a routing header according to claim 11, the method further characterised by the step of: storing each intermediary address in a data path to said intended recipient in a linked binding cache within the communication node, so that a substantially optimum data route via said addresses can be extracted from said linked binding cache in one pass for subsequently transmitted data packets.
 15. A communication message having a routing header generated in accordance with claim
 11. 16. A communication message having a routing header and a data packet, the routing header comprising: an intended recipient address of the data packet; the communication message characterised by: a plurality of intermediary addresses corresponding to a respective plurality of mobile routers to be used to forward said data packet to said intended recipient.
 17. The communication message according to claim 16, the communication message further characterised by the plurality of intermediary addresses being configured as respective IP headers where substantially each contains a sender address as a source address of the communication message and one of said plurality of intermediary addresses as a destination address.
 18. A communication unit having: a memory element storing a linked binding cache; and a processor, operably coupled to the memory element, for generating a routing process, based on information stored in the linked binding cache, for delivering a data packet to an intended recipient.
 19. The communication unit according to claim 18, wherein linked binding cache includes pointers from one entry to the other when the care-of-address of an entry fits into the range defined for another's prefix.
 20. A communication unit having: a processor operably coupled to a memory element storing a regular binding cache; wherein the communication unit is characterised by said processor employing a recursive approach of repeating said steps of searching, determining and replacing of new destination address(es) in the binding cache, in accordance with claim
 1. 21. A method for building a linked binding cache the method comprising the step of: storing a plurality of mobile router entries in a binding cache, wherein said plurality of mobile router entries include a first mobile router entry comprising a prefix and an indication of said prefix's length plus an associated intermediate address; and linking a second mobile router entry to said first mobile router entry for delivering at least one data packet via said first mobile router; the method characterised by the step of: adding a pointer in said binding cache from the entry of said second mobile router to said first mobile router entry when the intermediate address of said second mobile router matches the first mobile router's prefix in order to create a linked binding cache.
 22. The method for building a linked binding cache according to claim 21, the method further characterised by the step of: receiving a binding update message from a number of mobile routers to indicate their respective intermediate address in delivering at least one data packet to an intended recipient.
 23. The method for building a linked binding cache according to claim 21, the method further characterised by the steps of: receiving at least one tunnelled data packet at a third mobile router; de-tunnelling at least a portion of said at least one tunnelled data packet, by said third mobile router; and sending a binding update message to a communication unit indicating said third mobile router as an intermediate router for passing on a data packet to said intended recipient to enable a pointer to be added in said linked binding cache from entry of said third mobile router to a second mobile router address.
 24. The method for building a linked binding cache according to claim 21, wherein the step of receiving, de-tunnelling and sending are performed by substantially each mobile router in a data path to the intended recipient, so that a linked binding cache for a data path route can be generated in a single step.
 25. The method for building a linked binding cache according to claim 21, the method further characterised by the step of: comparing an intermediate address of said second mobile router to a prefix address of substantially each mobile router in said binding cache to determine whether a pointer should be added.
 26. The method for building a linked binding cache according to claim 25, the method further characterised by the step of: comparing, when a match in said comparison step is found, substantially all other intermediate addresses to a prefix address of said second mobile router, to determine whether a pointer should be added to said second mobile router address; and repeating the comparison step process until no further match for an intermediate address is determined, thereby generating a preferred route to send at least one data packet to said recipient.
 27. A storage medium storing processor-implementable instructions for controlling a processor to carry out the method according to claim
 1. 28. An apparatus adapted to perform the method according of claim
 1. 29. (canceled)
 30. (canceled)
 31. An apparatus adapted to perform the method according to claim
 11. 32. An apparatus adapted to perform the method according to claim
 21. 33. A storage medium storing processor-implementable instructions for controlling a processor to carry out the method according to claim
 11. 34. A storage medium storing processor-implementable instructions for controlling a processor to carry out the method according to claim
 21. 